Further, we show that round-optimality is achieved without trading-off the communication complexity; specifically, our protocols have an overall message ...

Abstract. Consider an arbitrary network of n nodes, up to any t of which are eavesdropped on by an adversary. A sender S wishes to send a message.

Round-optimal perfectly secret message transmission with linear communication complexity. In Information. Theoretic Security - 8th International Conference ...

It is shown that round-optimality is achieved without trading-off the communication complexity; specifically, the protocols have an overall communication ...

Abstract. In the model of Perfectly Secure Message Transmission (PSMT), a sender Alice is connected to a receiver Bob via n parallel two-way chan-.

Abstract. In the model that has become known as “Perfectly Secure. Message Transmission” (PSMT), a sender Alice is connected to a receiver.

Previous work has studied the round complexity and communication over- head of perfectly secure message transmission. The round complexity is the number of ...

Round-optimal perfectly secret message transmission with linear communication complexity. In A. Lehmann and S. Wolf, editors, Information Theoretic Security ...

This work deals with the communication complexity of secure multi-party protocols for linear algebra problems. In our model, complexity is measured in terms of ...

We study perfectly secure message transmission (SMT) in general synchronous networks where processors and communication lines may be Byzantine faulty.